Affine Alternating Sign Matrices
نویسنده
چکیده
An Alternating sign matrix is a square matrix of 0’s, 1’s, and −1’s in which the sum of the entries in each row or column is 1 and the signs of the nonzero entries in each row or column alternate. This paper attempts to define an analogue to alternating sign matrices which is infinite and periodic. After showing the analogue we define shares desirable cahracteristics with alternating sign matrices, we attempt to enumerate these “affine alternating sign matrices” finding results for some simple cases, though not a general result.
منابع مشابه
A ug 2 00 6 On polynomials interpolating between the stationary state of a O ( n ) model and a Q . H . E . ground state
We associate a polynomial to a system of lines projected onto the (punctured) disc with variables labelled by the ends of the lines. These polynomials are special cases of non-symmetric Macdonald polynomials at tk+1qr−1 = 1, obeying wheel vanishing conditions. We study more specifically the case k = 2 related to the affine Temperley and Lieb algebra and to O(n) loop models defined on the disc a...
متن کاملOn polynomials interpolating between the stationary state of a O ( n ) model and a Q . H . E . ground state
We associate a polynomial to a system of lines projected onto the (punctured) disc with variables labelled by the ends of the lines. These polynomials are special cases of non-symmetric Macdonald polynomials at tk+1qr−1 = 1, obeying wheel vanishing conditions. We study more specifically the case k = 2 related to the affine Temperley and Lieb algebra and to O(n) loop models defined on the disc a...
متن کاملPattern Avoidance in Alternating Sign Matrices
We generalize the definition of a pattern from permutations to alternating sign matrices. The number of alternating sign matrices avoiding 132 is proved to be counted by the large Schröder numbers, 1, 2, 6, 22, 90, 394 . . .. We give a bijection between 132-avoiding alternating sign matrices and Schröder-paths, which gives a refined enumeration. We also show that the 132, 123avoiding alternatin...
متن کاملSymmetric alternating sign matrices
In this note we consider completions of n×n symmetric (0,−1)-matrices to symmetric alternating sign matrices by replacing certain 0s with +1s. In particular, we prove that any n×n symmetric (0,−1)-matrix that can be completed to an alternating sign matrix by replacing some 0s with +1s can be completed to a symmetric alternating sign matrix. Similarly, any n × n symmetric (0,+1)-matrix that can ...
متن کاملAlternating Sign Matrices and Descending Plane Partitions
An alternating sign matrix is a square matrix such that (i) all entries are 1,-1, or 0, (ii) every row and column has sum 1, and (iii) in every row and column the nonzero entries alternate in sign. Striking numerical evidence of a connection between these matrices and the descending plane partitions introduced by Andrews (Invent. Math. 53 (1979), 193-225) have been discovered, but attempts to p...
متن کامل